A Load Balancing Algorithm Based on Replication and Movement af Data Items for Dynamic Structured P2P Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Load Balancing Algorithm Based on Replication and Movement of Data Items for Dynamic Structured P2p Systems

Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2...

متن کامل

Ant-based Load Balancing Algorithm in Structured P2P Systems

Dynamic load balancing is one key adaptation mechanism often deployed in networking and computing systems. Numerous proposals exist for load balancing in P2P networks. All of them will enhance the availability of P2P system to some extent. However, their convergence rate is still low, and the load collection overhead and load transfer overhead are high. In this paper, we propose an ant-based lo...

متن کامل

A Security-aware Load Balancing Algorithm for Structured P2P Systems Based on Ant Colony Optimization

Abstract In DHT-based P2P systems, the use of DHT and the heterogeneity of node capacities can cause a load imbalance problem, which may affect the DHT system efficiency. Many solutions have been proposed to tackle the load balancing issue. However, the convergence rate is still low, and they reassign loads among nodes without considering security factor. This paper proposes a security-aware lo...

متن کامل

A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems

Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2Psystems are not proximity-awa...

متن کامل

An Adaptive and Dynamic Load Balancing Algorithm for Structured P2P Systems

One important issue in the DHT design is how to balance the load across the nodes in the system. To achieve load balance, existing DHT-based P2P systems simply resort to the hash function to map objects to nodes randomly. However, the use of DHT and the heterogeneity of nodes capacities may give rise to load imbalance problems, and affect the DHT system efficiency as well. A new load balance al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Peer to Peer Networks

سال: 2014

ISSN: 2229-5240,2229-3930

DOI: 10.5121/ijp2p.2014.5302